Projections of regular orthogonal arrays
نویسندگان
چکیده
In this paper, we show that the projection of a regular orthogonal array of strength t onto more than t factors consists of replicates of either a fractional factorial or a full factorial design of strength t, depending on the number of factors retained in the projection.
منابع مشابه
β-galactosidase Production by Aspergillus niger ATCC 9142 Using Inexpensive Substrates in Solid-State Fermentation: Optimization by Orthogonal Arrays Design
Background: Enzymatic hydrolysis of lactose is one of the most important biotechnological processes in the food industry, which is accomplished by enzyme β-galactosidase (β-gal, β-D-galactoside galactohydrolase, EC 3.2.1.23), trivial called lactase. Orthogonal arrays design is an appropriate option for the optimization of biotechnological processes for the production of microbial...
متن کاملOrthogonal arrays of strength three from regular 3 - wise balanced designsCharles
The construction given in 4] is extended to obtain new innnite families of orthogonal arrays of strength 3. Regular 3-wise balanced designs play a central role in this construction.
متن کاملON THE CONTINUITY OF PROJECTIONS AND A GENERALIZED GRAM-SCHMIDT PROCESS
Let ? be an open connected subset of the complex plane C and let T be a bounded linear operator on a Hilbert space H. For ? in ? let e the orthogonal projection onto the null-space of T-?I . We discuss the necessary and sufficient conditions for the map ?? to b e continuous on ?. A generalized Gram- Schmidt process is also given.
متن کاملRandom Projections of Regular Polytopesk
Based on an approach of AAentranger&Schneider we give an asymptotic formula for the expected number of k-faces of the orthogonal projection of a regular n-crosspolytope onto a randomly chosen isotopic subspace of xed dimension, as n tends to innnity. In particular , we present a precise asymptotic formula for the (spherical) volume of spherical regular simplices, which generalizes Daniel's form...
متن کاملTwo-weight codes, graphs and orthogonal arrays
We investigate properties of two-weight codes over finite Frobenius rings, giving constructions for the modular case. A δ-modular code [15] is characterized as having a generator matrix where each column g appears with multiplicity δ|gR×| for some δ ∈ Q. Generalizing [10] and [5], we show that the additive group of a two-weight code satisfying certain constraint equations (and in particular a m...
متن کامل